Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings
نویسندگان
چکیده
منابع مشابه
Universal Eigenvalue Equations
ing d = f · b. Conversely, if this homomorphic condition holds everywhere, then apply b to both its sides, observe that Cχb = iA and by abstracting c get h = Cχa with a = h · b. Q.D.E. 5.8 Definitions. Keep the notation of 5.4 and let B be the set of bases of α with index X. Consider a family k: B → F(FXA)C, for some C, and a b ∈ B. If for all b′ ∈ B and M :X → A (43) kbM = kb′(M ◦ b′) , then w...
متن کاملThe Least Eigenvalue of Graphs
In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.
متن کاملNotes on graphs with least eigenvalue at least -2
A new proof concerning the determinant of the adjacency matrix of the line graph of a tree is presented and an invariant for line graphs, introduced by Cvetković and Lepović, with least eigenvalue at least −2 is revisited and given a new equivalent definition [D. Cvetković and M. Lepović. Cospectral graphs with least eigenvalue at least −2. Publ. Inst. Math., Nouv. Sér., 78(92):51–63, 2005.]. E...
متن کاملEla Notes on Graphs with Least Eigenvalue
A new proof concerning the determinant of the adjacency matrix of the line graph of a tree is presented and an invariant for line graphs, introduced by Cvetković and Lepović, with least eigenvalue at least −2 is revisited and given a new equivalent definition [D. Cvetković and M. Lepović. Cospectral graphs with least eigenvalue at least −2. Publ. Inst. Math., Nouv. Sér., 78(92):51–63, 2005.]. E...
متن کاملThe Komlos Conjecture Holds for Vector Colorings
The Komlós conjecture in discrepancy theory states that for some constant K and for any m× n matrix A whose columns lie in the unit ball there exists a vector x ∈ {−1,+1} such that ‖Ax‖∞ ≤ K. This conjecture also implies the Beck-Fiala conjecture on the discrepancy of bounded degree hypergraphs. Here we prove a natural relaxation of the Komlós conjecture: if the columns of A are assigned unit v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2017
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-017-9899-2